I've been playing with a RBT visualizer and don't understand how the following is considered height-balanced. The wikipedia article claims that if the RBT properties are satisfied, then the height of the farthest leaf is no greater than twice the height of height of the closest leaf. From my understanding, the below would violate this property, even if the RBT properties are satisfied (the depth of 1 is 1 and the depth of 6 is 3). Where is my logic flawed here?
How is this RBT considered balanced?
246 Views Asked by ilikemath3.14 At
1
There are 1 best solutions below
Related Questions in TREE
- prolog traverse nonstandard tree left to right
- Why would one use a heap over a self balancing binary search tree?
- recursively editing member variable: All instances have same value
- D3.js collapsable tree - visualise set number of levels
- java - How to generate Tree from two dimensional array
- Haskell, Tree problems
- d3 indented tree close other nodes with child and open only specific node
- Function that return average depth of a binary search tree
- SQL Tree Structure Table
- Java: make prefix tree remember last value that was not null
- C++: no matching function call
- Building SQL tree from random parent updates
- Use significant attributes only, or use full set of attributes to build J48 model after checking information gain?
- Trie Data Structure in Finding an Optimal Solution
- How to store data in a tree structure in R?
Related Questions in BINARY-TREE
- How to Compute Space Complexity for Printing All paths which Sum to a Given Value in Binary Tree
- Recursively divide a list that each iteration divides into two parts to get the closest sum overall
- Function that return average depth of a binary search tree
- Print a Binary Search Tree with Correct Formatting
- Recursive Tree Walk with ES6 Promise
- Making a very basic binary tree in Scala
- maximum sum of value from root to leaf in a binary tree using stack
- How to Compute Space Complexity for Binary SubTree Finding
- Scala: How to compute the sum of all elements in the leaves of a Binary Tree?
- Pass a value by reference in a function to find level of node in a binary tree
- How to implement remove() method in binary search tree iterator
- How to copy an object in Scala?
- Complex conditional filter design
- Recursively count children nodes in binary tree
- Updating value of node in Scala?
Related Questions in BINARY-SEARCH-TREE
- Why would one use a heap over a self balancing binary search tree?
- Search list for objects valid in a time range
- Couting nodes with onyl one child in BST
- Trouble implementing avl tree in java
- Find the parent node of a node in binary search tree
- Function that return average depth of a binary search tree
- Print a Binary Search Tree with Correct Formatting
- How to calculate depth of each node in Binary Search Tree?
- How to rotate Binary Tree recursion given a null stopper
- Segmentation fault when using if statement with pointers (BST tree)
- Finding the minimum and maximum height in a AVL tree, given a number of nodes?
- Binary Search Tree insertion - root remains null
- How do I go about the traversal of Binary Search Trees?
- Insert function in a Binary Search Tree
- Implementing a parent node in AVL tree
Related Questions in RED-BLACK-TREE
- Why the leaf node in red black tree is NIL?
- Error in inserting nodes in red black trees
- Understanding Red-Black Tree Traversal of STL multiset in GDB
- Implementing Tree Structure in disk memory
- Binary heap data structure - Application
- Red Black Tree Insertion Not Working
- Difficulty in writing Red Black Tree in F#
- Treemap - Binary Search Tree - Java
- geometric search in red black binary search tree
- Red Black Trees complexities
- insert_rebalance in red-black tree
- STL-like Java Red-black tree / TreeSet/Map and linked lists with non fail-fast/safe iterators
- Looking for efficient way to index files
- How to implement a Multiset with a RedBlack Tree?
- red black tree - element removal without dummys
Related Questions in RED-BLACK-TREE-INSERTION
- Red-Black tree help C
- Red-Black Tree in Rust, getting 'expected struct Node, found mutable reference'
- How is this RBT considered balanced?
- Error: Cannot read field "color" because "u" is null RED BLACK TREE
- Segmentation Fault (core dumped) during Red-Black tree "correction" - C
- Red-Black Tree Insertion Code
- Red-black tree insertion task
- What makes this Red/Black tree left heavy and is it correct?
- red black tree insertion
- Why use heap over red-black tree?
- On Red Black Tree rotation, is the black height of all nodes preserved?
- Unusual Java implementation of red/black tree node insertion
- BST and RBT insersion worse case
- Determine node colour in Red Black Tree
- Red-Black Tree rebalancing crashes on tree rotation
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
From the Wikipedia article:
The diagram you've included in your question has omitted these
NILnodes, but they are relevant for the determination of balanced. Using the rule you describe ("the path from the root to the farthest leaf is no more than twice as long as the path from the root to the nearest leaf"), the path from the root to the nearest leaf has a distance of two (not one), and the path from the root to the farthest leaf has a distance of four (not three).Since four is not more than twice two, this tree complies with the "balanced" rule.