KNOW: Tree, Trie, Graph

最新推荐文章于 2021-04-25 20:33:35 发布

b_end_an

最新推荐文章于 2021-04-25 20:33:35 发布

阅读量851

点赞数

CC 4.0 BY-SA版权

分类专栏： !!!Interview Topics

本文链接：https://blog.youkuaiyun.com/b_end_an/article/details/9957923

!!!Interview Topics 专栏收录该内容

11 篇文章

订阅专栏

本文详细介绍了二叉树与前缀树的基本概念、实现方式及应用场景，并对比了二叉树与二叉搜索树的区别。此外还概述了几种常见的树遍历方法，包括前序、中序、后序及层次遍历。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Binary Tree

A binary tree is a tree in which no node can have more than two children.

The depth of an average binary tree is considerably smaller than N.

For binary search tree, the average depth is O(logN)

Difference between BT and BST:http://stackoverflow.com/questions/6380231/difference-between-binary-tree-and-binary-search-tree

Binary Tree Implementation

http://blog.youkuaiyun.com/b_end_an/article/details/9975943

Binary Search Tree

For BST questions, we need to clarify if we allow duplicate!

http://stackoverflow.com/questions/300935/definition-of-a-binary-search-tree

Tree Traversal

http://en.wikipedia.org/wiki/Tree_traversal#Depth-first

Different way to implement tree traversal: http://blog.youkuaiyun.com/kofsky/article/details/2886453

Iterative post-order traverse tree: http://leetcode.com/2010/10/binary-tree-post-order-traversal.html

Pre-order:

Visit the root.
Traverse the left subtree.
Traverse the right subtree.

In-order (symmetric):

Traverse the left subtree.
Visit the root.
Traverse the right subtree.

Post-order:

Traverse the left subtree.
Traverse the right subtree.
Visit the root.

Level-order:

Traverse each node on a level
Go to the next level

Trie

http://en.wikipedia.org/wiki/Trie

In computer science, a trie, also called digital tree or sometimes radix tree or prefix tree (because we can search by prefixes), is anordered tree data structure that is used to store a dynamic set or associative array where the keys are usually strings. Unlike a binary search tree, no node in the tree stores the key associated with that node; instead, its position in the tree defines the key with which it is associated. All the descendants of a node have a common prefix of the string associated with that node, and the root is associated with the empty string. Values are normally not associated with every node, only with leaves and some inner nodes that correspond to keys of interest.