LeetCode-Notes
search
⌘Ctrlk
LeetCode-Notes
  • Introduction
  • Records of Practice
  • 关于Github 不支持密码问题
  • 面试题
    • 搜索广告
    • 多模态大模型
    • 刷题技巧+经典题
  • 算法代码实现
  • Python
    • Python 笔记
  • Spark
    • PySpark
    • Spark Issues
    • Spark调优笔记
  • FeatureEngineering
  • Recommendation Algorithm
    • Recall-and-PreRank
    • Ranking
    • DeepLearning-Basic
  • Machine Learning
    • XGBoost
    • Cross Entropy Loss
    • Other models
  • Graph Neural Network
    • GNN-1-Basic
  • Big Data
    • Reservoir Sampling
  • SQL
    • SQL and PySpark functions
    • Query Film Infomation
    • Create, Insert and Alter Actor Table
    • Manage Employment Data
    • Manage Employment Data -2
  • DataStructure
    • Searching
    • Array
    • Sorting
    • LinkedList
    • Tree
      • Find Tree height (general iteration method)
      • Check BST and Check CompleteTree
      • ZigZag Order traversal
      • Binary Tree diameter I
      • Maximum Path Sum Binary Tree
      • Maximum Path Sum Binary Tree II
      • Binary Tree Path Sum To Target III
      • Tree diameter 树的直径II
      • Tree ReConstruction
      • Check if B is Subtree of A
      • The Kth smallest in Binary Search Tree
      • 打印Tree的右视图
      • 二叉搜索树的后序遍历序列
      • 重建二叉树
      • 判断二叉树是否对称
      • Path Sum to Target in Binary Tree
      • Tree-PreOrder-InOrder-PostOrder
    • Heap&Queue
    • 合并k个已排序的链表
    • String
    • DFS/BFS
    • DynamicProgramming
  • Big Data Algorithms
    • Big Data Processing Algorithms
gitbookPowered by GitBook
block-quoteOn this pagechevron-down
  1. DataStructure

Tree

Find Tree height (general iteration method)chevron-rightCheck BST and Check CompleteTreechevron-rightZigZag Order traversalchevron-rightBinary Tree diameter Ichevron-rightMaximum Path Sum Binary Treechevron-rightMaximum Path Sum Binary Tree IIchevron-rightBinary Tree Path Sum To Target IIIchevron-rightTree diameter 树的直径IIchevron-rightTree ReConstructionchevron-rightCheck if B is Subtree of Achevron-rightThe Kth smallest in Binary Search Treechevron-right打印Tree的右视图chevron-right二叉搜索树的后序遍历序列chevron-right重建二叉树chevron-right判断二叉树是否对称chevron-rightPath Sum to Target in Binary Treechevron-rightTree-PreOrder-InOrder-PostOrderchevron-right
Previous删除链表里面重复的元素-1chevron-leftNextFind Tree height (general iteration method)chevron-right

Last updated 4 years ago