Binary Tree Operations(III) - Convert a Binary Tree to Down-Right Representation
2014-09-13 10:31
218 查看
This is the third article on binary tree operations. For other topics on binary tree, please refer to:
Binary Tree Operations(I)
Binary Tree Operations(II)
Left-Right representation of a binary tree is standard representation where every node has a pointer to left child and another pointer to right child.
Down-Right representation is an alternate representation where every node has a pointer to left (or first) child and another pointer to next sibling. So siblings at every level are connected from left to right.
- See more at:
http://bo-yang.github.io/2014/09/12/binary-tree-iii/#sthash.9lcJZ2dH.dpuf
http://bo-yang.github.io/2014/09/12/binary-tree-iii
Binary Tree Operations(I)
Binary Tree Operations(II)
Left-Right representation of a binary tree is standard representation where every node has a pointer to left child and another pointer to right child.
Down-Right representation is an alternate representation where every node has a pointer to left (or first) child and another pointer to next sibling. So siblings at every level are connected from left to right.
- See more at:
http://bo-yang.github.io/2014/09/12/binary-tree-iii/#sthash.9lcJZ2dH.dpuf
http://bo-yang.github.io/2014/09/12/binary-tree-iii
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- 【Leetcode】【Medium】Convert Sorted Array to Binary Search Tree
- 把排序数组转换为高度最小的二叉搜索树convert-sorted-array-to-binary-search-tree-with-minimal-height
- LeetCode Convert Sorted List to Binary Search Tree（有序单链表转为平衡二叉树）
- [LeetCode]108 Convert Sorted Array to Binary Search Tree
- 109. Convert Sorted List to Binary Search Tree LeetCode
- LeetCode108_Convert SortedArray to BinarySearchTree(将有序数组转成二叉排序树) Java题解
- Convert Sorted List to Binary Search Tree
- Convert Sorted Array to Binary Search Tree （递增数组建高度平衡的二叉查找树）【leetcode】
- LeetCode Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- [LeetCode#109]Convert Sorted List to Binary Search Tree
- LeetCode | Convert Sorted Array to Binary Search Tree（有序数组转换成平衡二叉树搜索树）
- LeetCode | Convert Sorted List to Binary Search Tree（链表转换成二叉搜索树）
- LeetCode: Convert Sorted Array to Binary Search Tree [108]
- LeetCode--Convert Sorted Array to Binary Search Tree（平衡二叉搜索树）
- 108 Convert Sorted Array to Binary Search Tree
- Leetcode: Convert Sorted Array to Binary Search Tree
- leetcode 109 —— Convert Sorted List to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- 【LeetCode-面试算法经典-Java实现】【108-Convert Sorted Array to Binary Search Tree（排序数组转变为平衡二叉树）】