search

algorithm003 / algorithm

17 stars 88 forks source link

【051-week1】个人学习总结 #162

Open cc1901 opened 5 years ago

cc1901 commented 5 years ago

学习笔记

week_02

  1. When need to build balance binary search tree use TreeSet in java
  2. E ceiling(E e);
    • Returns the least element in this set greater than or equal to the given element, or null if there is no such element. O(log(N))
  3. E floor(E e);
    • Returns the greatest element in this set less than or equal to the given element, or {@code null} if there is no such element. O(log(N))
wenicaicai commented 5 years ago

this guys is good at English to express himself,and it encourage other to use English at more at possible.