What is a Red-Black Tree in context to data structures?

What is a Red-Black Tree in context to data structures?

题目类型: 技术面试题

这是一道技术面试题，常见于澳洲IT公司面试中。

难度: easy

标签: interviewbit, goldman-sachs, company-specific

目标公司: Goldman Sachs

参考答案摘要

A red-black tree is a self-balancing binary search tree with one extra bit at each node, which is commonly read as the colour (red or black). These colours are used to keep the tree balanced as insert...

本题提供 STAR 原则详细解答和技术解析，登录匠人学院学习中心即可查看完整答案。